Deleting digits
نویسندگان
چکیده
منابع مشابه
Quantum deleting and signalling
It is known that if one could clone an arbitrary quantum state then one could send signals faster than the speed of light. Here, we show that deletion of an unknown quantum state for which two copies are available would also lead to superluminal signalling. However, the (Landauer) erasure of an unknown quantum state does not allow faster-than-light communication. 2003 Published by Elsevier B.V.
متن کاملDeleting Powers in Words
We consider the language consisting of all words such that it is possible to obtain the empty word by iteratively deleting powers. It turns out that in the case of deleting squares in binary words this language is regular, and in the case of deleting squares in words over a larger alphabet the language is not regular. However, for deleting squares over any alphabet we find that this language ca...
متن کاملDeleting keratins to find one
ered a third murine K6 gene, and simultaneously created a promising model system for studying keratin function in more detail. In an effort to study the function of K6, the authors generated a mouse line lacking both K6a and K6b, and found that plaques develop on the tongues of these mice and cause the majority to die of starvation within two weeks of birth. Surprisingly, and in contrast to a p...
متن کاملDeleting Redundancy in Proof Reconstruction
H. de Swaart, ed., International Conference TABLEAUX-98 , LNAI 1397, pp. 262–277, c ©Springer Verlag, 1998. Abstract. We present a framework for eliminating redundancies during the reconstruction of sequent proofs from matrix proofs. We show that search-free proof reconstruction requires knowledge from the proof search process. We relate different levels of proof knowledge to reconstruction kno...
متن کاملDeleting Vertices to Bound Path Length
We examine the vertex deletion problem for weighted directed acyclic graphs (wdags). The objective is to delete the fewest number of vertices so that the resulting wdag has no path of length > δ. Several simplified versions of this problem are shown to be NP-hard. However, the problem is solved in linear time when the wdag is a rooted tree and in quadratic time when the wdag is a series-paralle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Mathematical Gazette
سال: 2017
ISSN: 0025-5572,2056-6328
DOI: 10.1017/mag.2017.6